VerChor: A Framework for Verifying Choreographies
نویسندگان
چکیده
Nowadays, modern applications are often constructed by reusing and assembling distributed and collaborating entities, e.g., software components, Web services, or Software as a Service in cloud computing environments. In order to facilitate the integration of independently developed components (i.e., peers) that may reside in different organizations, it is necessary to provide a global contract to which the peers participating in a service composition should adhere. Such a contract is called choreography, and specifies interactions among a set of services from a global point of view. This contract is the reference for the further development steps (service selection, code generation, maintenance, reconfiguration, etc.). The specification and formal analysis of this contract is therefore crucial and must be handled carefully by the designer to avoid an erroneous design, which would be very costly if discovered lately in the development process. Unfortunately, only limited effort, e.g. [3,6,1], has been spent to develop formal verification tools, which can automatically detect issues such as deadlocks or erroneous behaviours in the choreography specification. In this paper, we propose a modular framework for performing automatically a number of crucial verification tasks on choreography specifications. Our framework accepts as input the following interaction-based choreography description languages: (i) XML-based languages (WS-CDL), (ii) graphical notations (BPMN 2.0 choreographies), and (iii) formal description models (Chor, conversation protocols). In order to favour extensibility and reusability of our framework, we
منابع مشابه
On the integration of declarative choreographies and Commitment-based agent societies into the SCIFF logic programming framework
The definition of choreography specification languages for Service Oriented Systems poses important challenges. Mainstream approaches tend to focus on procedural aspects, leading to over-constrained and over-specified models. Because of such a drawback, declarative languages are gaining popularity as a better way to model service choreographies. A similar issue was met in the Multi-Agent System...
متن کاملA Symbolic Framework for the Conformance Checking of Value-Passing Choreographies
Choreographies, thanks to their abstract and global perspective, are well-suited to the specification of distributed systems such as service compositions and collaborative business processes. Choreography conformance checking aims at verifying whether a set of distributed peers or local role specifications match a global specification. This activity is central in both top-down and bottom-up dev...
متن کاملModeling and verifying business processes and choreographies through the abductive proof procedure SCIFF and its extensions
In this article we survey our recent research activity concerning the use of logic programming, and in particular of abduction, for interaction specification and verification in several domains. We outline relevant results in the areas of multi-agent systems, argumentation, web services choreographies and business processes.
متن کاملCompositional Choreographies
We propose a new programming model that supports a compositionality of choreographies. The key of our approach is the introduction of partial choreographies, which can mix global descriptions with communications among external peers. We prove that if two choreographies are composable, then the endpoints independently generated from each choreography are also composable, preserving their typabil...
متن کاملConformance Test of Federated Choreographies
Web Services technology is constantly gaining importance for automation of business processes. A major contribution of this technology is its integration capability, i.e. compositions allowing several autonomous but cooperating web services to implement a business process going beyond the boundaries of a single organization. Federated choreographies provide a framework for modular modeling comp...
متن کامل